/*
 * Copyright 1990-2008, Mark Little, University of Newcastle upon Tyne
 * and others contributors as indicated 
 * by the @authors tag. All rights reserved. 
 * See the copyright.txt in the distribution for a
 * full listing of individual contributors. 
 * This copyrighted material is made available to anyone wishing to use,
 * modify, copy, or redistribute it subject to the terms and conditions
 * of the GNU Lesser General Public License, v. 2.1.
 * This program is distributed in the hope that it will be useful, but WITHOUT A 
 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A 
 * PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more details.
 * You should have received a copy of the GNU Lesser General Public License,
 * v.2.1 along with this distribution; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, 
 * MA  02110-1301, USA.
 * 
 * (C) 1990-2008,
 */
 /*
 * Copyright (C) 1994
 *
 * Department of Computing Science,
 * The University,
 * Newcastle upon Tyne,
 * UK.
 */


#ifndef SET_H_
#  include "Set.h"
#endif

#ifndef ELEMENT_H_
#  include "Element.h"
#endif


Set::Set () {}

Set::~Set () {}

Set* Set::Intersect (Set* toCheck) const
{
    Set* tempSet = new Set;
    Element *E = 0;
    
    if (!Empty() && !toCheck->Empty())
    {
	E = (Element*) First();
	
	while (E)
	{
	    if (E->Belongs(toCheck))
	    {
		Element* toAdd = new Element(E->GetValue());
		toAdd->InTo(tempSet);
	    }
	    
	    E = (Element*) E->Suc();
	}
    }

    return tempSet;
}
